Non-simplifying Graph Rewriting Termination
نویسندگان
چکیده
منابع مشابه
Non-simplifying Graph Rewriting Termination
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky’s work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs and of using graph rewriting rules to compute on those stru...
متن کاملTermination of Graph Rewriting is Undecidable
It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turing machines or of the termination problem for string rewriting systems to the present problem.
متن کاملTermination of graph rewriting is undecidable Detlef
It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turing machines or of the termination problem for string rewriting systems to the present problem.
متن کاملProving Termination of Unfolding Graph Rewriting for General Safe Recursion
In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over sequences of terms together with an interpretation of term graphs into sequences of terms. Unfolding graph rewrite rules expressing general safe recursion ca...
متن کاملSimple gap termination for term graph rewriting systems
This paper proves the extension of Kruskal-Friedman theorem, which is an extension of the ordinary Kruskal's theorem with gap-condition, on !-trees (Main theorem 1 in section 3). Based on the theorem, a new termination criteria for cyclic term graph rewriting systems, named simple gap termination (Main theorem 2 in section 4), is proposed where the naive extension of simple termination (based o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.110.3